Watershed from Propagated Markers Based on Border Tracking by Graph Matching
نویسندگان
چکیده
This paper introduces the application of graph matching as a suporting technique to the watershed from propagated markers framework. In this work, markers are propagated by attributed relational graph matching, which attributes are collected from the moving borders of the objects of interests. The advantage of this version of the watershed from propagated markers is the production of markers that tends to be locally shaped as the object of interest and closer to its border, which provides a better segmentation result. This approach was compared to the manual segmentation (by standard watershed from markers) and to a method found in literature and the results achieved by the proposed approach were efficient and robust.
منابع مشابه
Segmentation-based object tracking using image warping and Kalman filtering
We propose a segmentation-based method of object tracking using image warping and Kalman filtering. The object region is defined to include a group of patches, which are obtained by a watershed algorithm. In a robust M-estimator framework, we estimate dominant motion of the object region. A linear Kalman filter is employed to predict the estimated affine motion parameters based on a second orde...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملA Region-Based Method for Model-Free Object Tracking
We propose a region-based method for model-free object tracking. In our method the object information of temporal motion and spatial luminance are fully utilized. We first compute dominant motion of the tracked object. Using this result we warp the object template to generate a prediction template. Static segmentation is incorporated to modify this prediction, where the warping error of each wa...
متن کاملیک الگوریتم ردیابی خودرو مبتنی بر ویژگی با استفاده از گروهبندی سلسله مراتبی ادغام و تقسیم
Vehicle tracking is an important issue in Intelligence Transportation Systems (ITS) to estimate the location of vehicle in the next frame. In this paper, a feature-based vehicle tracking algorithm using Kanade-Lucas-Tomasi (KLT) feature tracker is developed. In this algorithm, a merge and split-based hierarchical two-stage grouping algorithm is proposed to represent vehicles from the tracked fe...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کامل